منابع مشابه
Estimating the Number of Wideband Radio Sources
In this paper, a new approach for estimating the number of wideband sources is proposed which is based on RSS or ISM algorithms. Numerical results show that the MDL-based and EIT-based proposed algorithm havea much better detection performance than that in EGM and AIC cases for small differences between the incident angles of sources. In addition, for similar conditions, RSS algorithm offers hi...
متن کاملEstimating the Condition Number of the Fréchet Derivative of a Matrix Function
ESTIMATING THE CONDITION NUMBER OF THE FRÉCHET DERIVATIVE OF A MATRIX FUNCTION∗ NICHOLAS J. HIGHAM† AND SAMUEL D. RELTON† Abstract. The Fréchet derivative Lf of a matrix function f : C n×n → Cn×n is used in a variety of applications and several algorithms are available for computing it. We define a condition number for the Fréchet derivative and derive upper and lower bounds for it that differ ...
متن کاملComputing the Fréchet Derivative of the Matrix Logarithm and Estimating the Condition Number
The most popular method for computing the matrix logarithm is the inverse scaling and squaring method, which is the basis of the recent algorithm of [A. H. Al-Mohy and N. J. Higham, Improved inverse scaling and squaring algorithms for the matrix logarithm, SIAM J. Sci. Comput., 34 (2012), pp. C152–C169]. We show that by differentiating the latter algorithm a backward stable algorithm for comput...
متن کاملestimating the number of wideband radio sources
in this paper, a new approach for estimating the number of wideband sources is proposed which is based on rss or ism algorithms. numerical results show that the mdl-based and eit-based proposed algorithm havea much better detection performance than that in egm and aic cases for small differences between the incident angles of sources. in addition, for similar conditions, rss algorithm offers hi...
متن کاملEstimating the number of clusters
Hartigan (1975) defines the number q of clusters in a d-variate statistical population as the number of connected components of the set {f > c}, where f denotes the underlying density function on IR and c is a given constant. Some usual cluster algorithms treat q as an input which must be given in advance. The authors propose a method for estimating this parameter which is based on the computat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2014
ISSN: 1017-1398,1572-9265
DOI: 10.1007/s11075-014-9947-4